A simple characterization of tightness for convex solid sets of positive random variables
نویسندگان
چکیده
منابع مشابه
The Concepts of Tightness for Fuzzy Set Valued Random Variables
In this paper, we introduce several concepts of tightness for a sequence of random variables taking values in the space of normal and upper-semicontinuous fuzzy sets with compact support in Rp and give some characterizations of their concepts. Also, counter-examples for the relationships between the concepts of tightness are given.
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
A new rejection sampling method for truncated multivariate Gaussian random variables restricted to convex sets
Statistical researchers have shown increasing interest in generating truncated multivariate normal distributions. In this paper, we only assume that the acceptance region is convex and we focus on rejection sampling. We propose a new algorithm that outperforms crude rejection method for the simulation of truncated multivariate Gaussian random variables. The proposed algorithm is based on a gene...
متن کاملRandom generation of Q-convex sets
The problem of randomly generating Q-convex sets is considered. We present two generators. The first one uses the Q-convex hull of a set of random points in order to generate a Q-convex set included in the square [0, n)2. This generator is very simple, but is not uniform and its performance is quadratic in n. The second one exploits a coding of the salient points, which generalizes the coding o...
متن کاملConvex underestimation for posynomial functions of positive variables
The approximation of the convex envelope of nonconvex functions is an essential part in deterministic global optimization techniques (Floudas inDeterministic Global Optimization: Theory, Methods and Application, 2000). Current convex underestimation algorithms for multilinear terms, based on arithmetic intervals or recursive arithmetic intervals (Hamed in Calculation of bounds on variables and ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Positivity
سال: 2018
ISSN: 1385-1292,1572-9281
DOI: 10.1007/s11117-018-0556-7